Cycles in Graphs and Groups
نویسنده
چکیده
If a group G of automorphisms of a graph Γ acts transitively on the set of vertices, then Γ is d-valent for some d: each vertex is adjacent to exactly d others. This note concerns cycles in Γ, by which we will mean subgraphs isomorphic to a k-cycle for some k ≥ 3; hence there will be no “initial” vertex. If g ∈ G and C is a cycle in Γ, then g(C) is another cycle in Γ: G acts on the set of all cycles in Γ. There is another meaning of the word “cycle”: each element of G can be written as a product of disjoint cycles of the set of vertices. If C = (1, . . . , k) is such a cycle and g ∈ G, then an elementary calculation gives gCg−1 = (g(1), . . . , g(k)), and this is just g(C) if C is viewed as a cyclically ordered set of vertices. In other words, the conjugation and functional actions behave the same. In a 1971 lecture, J. H. Conway [6] presented the following result, which merges these two meanings of “cycle” when G can move any ordered pair of adjacent vertices to any other such pair:
منابع مشابه
0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملA generalization of zero-divisor graphs
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
متن کاملOn Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 115 شماره
صفحات -
تاریخ انتشار 2008